Termination w.r.t. Q of the following Term Rewriting System could be disproven:

Q restricted rewrite system:
The TRS R consists of the following rules:

g(X) → u(h(X), h(X), X)
u(d, c(Y), X) → k(Y)
h(d) → c(a)
h(d) → c(b)
f(k(a), k(b), X) → f(X, X, X)

Q is empty.


↳ QTRS
  ↳ DependencyPairsProof

Q restricted rewrite system:
The TRS R consists of the following rules:

g(X) → u(h(X), h(X), X)
u(d, c(Y), X) → k(Y)
h(d) → c(a)
h(d) → c(b)
f(k(a), k(b), X) → f(X, X, X)

Q is empty.

Using Dependency Pairs [1,15] we result in the following initial DP problem:
Q DP problem:
The TRS P consists of the following rules:

G(X) → U(h(X), h(X), X)
F(k(a), k(b), X) → F(X, X, X)
G(X) → H(X)

The TRS R consists of the following rules:

g(X) → u(h(X), h(X), X)
u(d, c(Y), X) → k(Y)
h(d) → c(a)
h(d) → c(b)
f(k(a), k(b), X) → f(X, X, X)

Q is empty.
We have to consider all minimal (P,Q,R)-chains.

↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof

Q DP problem:
The TRS P consists of the following rules:

G(X) → U(h(X), h(X), X)
F(k(a), k(b), X) → F(X, X, X)
G(X) → H(X)

The TRS R consists of the following rules:

g(X) → u(h(X), h(X), X)
u(d, c(Y), X) → k(Y)
h(d) → c(a)
h(d) → c(b)
f(k(a), k(b), X) → f(X, X, X)

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The approximation of the Dependency Graph [15,17,22] contains 1 SCC with 2 less nodes.

↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ QDP
          ↳ NonTerminationProof

Q DP problem:
The TRS P consists of the following rules:

F(k(a), k(b), X) → F(X, X, X)

The TRS R consists of the following rules:

g(X) → u(h(X), h(X), X)
u(d, c(Y), X) → k(Y)
h(d) → c(a)
h(d) → c(b)
f(k(a), k(b), X) → f(X, X, X)

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We used the non-termination processor [17] to show that the DP problem is infinite.
Found a loop by narrowing to the left:

The TRS P consists of the following rules:

F(k(a), k(b), X) → F(X, X, X)

The TRS R consists of the following rules:

g(X) → u(h(X), h(X), X)
u(d, c(Y), X) → k(Y)
h(d) → c(a)
h(d) → c(b)
f(k(a), k(b), X) → f(X, X, X)


s = F(u(d, h(d), X'), u(d, h(d), X''), X) evaluates to t =F(X, X, X)

Thus s starts an infinite chain as s semiunifies with t with the following substitutions:



Rewriting sequence

F(u(d, h(d), X'), u(d, h(d), X'), u(d, h(d), X')) → F(u(d, h(d), X'), u(d, c(b), X'), u(d, h(d), X'))
with rule h(d) → c(b) at position [1,1] and matcher [ ]

F(u(d, h(d), X'), u(d, c(b), X'), u(d, h(d), X')) → F(u(d, h(d), X'), k(b), u(d, h(d), X'))
with rule u(d, c(Y), X'') → k(Y) at position [1] and matcher [X'' / X', Y / b]

F(u(d, h(d), X'), k(b), u(d, h(d), X')) → F(u(d, c(a), X'), k(b), u(d, h(d), X'))
with rule h(d) → c(a) at position [0,1] and matcher [ ]

F(u(d, c(a), X'), k(b), u(d, h(d), X')) → F(k(a), k(b), u(d, h(d), X'))
with rule u(d, c(Y), X'') → k(Y) at position [0] and matcher [X'' / X', Y / a]

F(k(a), k(b), u(d, h(d), X')) → F(u(d, h(d), X'), u(d, h(d), X'), u(d, h(d), X'))
with rule F(k(a), k(b), X) → F(X, X, X)

Now applying the matcher to the start term leads to a term which is equal to the last term in the rewriting sequence


All these steps are and every following step will be a correct step w.r.t to Q.